Self-organized Balanced Resources in Random Networks with Transportation Bandwidths

We apply statistical physics to study the task of resource allocation in random networks with limited bandwidths for the transportation of resources along the links. We derive algorithms which searches the optimal solution without the need of a global optimizer. For networks with uniformly high connectivity, the resource shortage of a node becomes a well-defined function of its capacity. An efficient profile of the allocated resources is found, with clusters of node interconnected by an extensive fraction of unsaturated links, enabling the resource shortages among the nodes to remain balanced. The capacity-shortage relation exhibits features similar to the Maxwell’s construction. For scalefree networks, such an efficient profile is observed even for nodes of low connectivity.